Note on implementing the new sphere method for LP using matrix inversions sparingly

نویسندگان

  • Katta G. Murty
  • Mohammad R. Oskoorouchi
چکیده

A new IPM (Interior Point Method) for LPs has been discussed in [9, 10] based on a centering step that attempts to maximize the radius of the inscribed sphere with center on the current objective plane, and using descent directions derived without using matrix inversions. The method is a descent method and may be called the sphere method for LP. In contrast to all the existing IPMs which involve heavy matrix inversions in each step, an advantage of the new method is that it can be implemented with no matrix inversions, or using them only sparingly. We discuss various techniques for implementing this method. These implementations offer the prospect of extending the superior performance of existing software systems for LP, to models that do not have the property of being

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A NOTE ON THE ZIMMERMANN METHOD FOR SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS

There are several methods for solving fuzzy linear programming (FLP)problems. When the constraints and/or the objective function are fuzzy, the methodsproposed by Zimmermann, Verdegay, Chanas and Werners are used more often thanthe others. In the Zimmerman method (ZM) the main objective function cx is addedto the constraints as a fuzzy goal and the corresponding linear programming (LP)problem w...

متن کامل

New Sphere Methods for Linear Programs

A new method being developed for solving linear programs is discussed in this tutorial. This method uses matrix inversion operations sparingly, and it thus seems well suited to solve large-scale problems and those that may not have the property of being very sparse.

متن کامل

Determining appropriate weight for criteria in multi criteria group decision making problems using an Lp model and similarity measure

Decision matrix in group decision making problems depends on a lot of criteria. It is essential to know the necessity ofweight or coefficient of each criterion. Accurate and precise selection of weight will help to achieve the intended goal.The aim of this article is to introduce a linear programming model for recognizing the importance of each criterion inmulti criteria group decision making w...

متن کامل

Nonlinear Analysis of Truss Structures Using Dynamic Relaxation (RESEARCH NOTE)

This paper presents a new approach for large-deflection analysis of truss structures employing the Dynamic Relaxation method (DR). The typical formulation for DR has been established utilizing the finite difference technique which is categorized as an explicit method. The special characteristic of the explicit method is its simple algebraic relationships in comparison with complicated matrix op...

متن کامل

O(m) Bound on Number of Iterations in Sphere Methods for LP

Consider the linear program (LP): minimize z = cx, subject to Ax ≥ b, where A is an m×n matrix. Sphere methods (SMs) for solving this LP were introduced in Murty [5, 6], even though this name was not used there. Theorems in those papers claimed that a version of this method needs at most O(m) iterations to solve this LP, however Mirzaian [2] pointed out an error in the proofs of these theorems ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Optimization Letters

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2009